Markers to construct DC free (d, k) constrained balanced block codes using Knuth’s inversion

نویسندگان

  • H. C. Ferreira
  • J. H. Weber
  • C. H. Heymann
  • K. A. S. Immink
چکیده

We adapt Knuth’s balancing scheme, which was originally developed for unconstrained binary code words. We present a simple method to balance the NRZ runlength constrained block codes corresponding to (d, k) constrained NRZI sequences. A short marker violating the maximum runlength or k constraint is used to indicate the balancing point for Knuth’s inversion. The marker requires fewer overhead bits and less implementation complexity than indexing the balancing point’s address by mapping it onto a (d, k) or runlength constrained prefix, such as when applying Knuth’s original scheme more directly. The new code construction may be attractive for future magnetic and especially optical recording schemes. In fact the current optical storage media such as the CD, DVD and Blue Ray Disc, all attempt to achieve some suppression of low frequency components of the constrained codes, by exploiting a limited degree of freedom within the set of candidate (d, k) words.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Construction for Balancing Non-Binary Sequences Based on Gray Code Prefixes

We introduce a new construction for the balancing of non-binary sequences that make use of Gray codes for prefix coding. Our construction provides full encoding and decoding of sequences, including the prefix. This construction is based on a generalization of Knuth’s parallel balancing approach, which can handle very long information sequences. However, the overall sequence—composed of the info...

متن کامل

Knuth's balancing of codewords revisited

In 1986, Don Knuth published a very simple algorithm for constructing sets of bipolar codewords with equal numbers of ’1’s and ’-1’s, called balanced codes. Knuth’s algorithm is, since look-up tables are absent, well suited for use with large codewords. The redundancy of Knuth’s balanced codes is a factor of two larger than that of a code comprising the full set of balanced codewords. In our pa...

متن کامل

Constructions of error-correcting DC-free block codes

A (2n, k , I, c ,d) dc free binary block code is a code of length 2n, constant weight n , 2/c. codewords, maximum runlength of a symbol I , maximum accumulated charge c, and minimum distance d. The requirements ar~ that k and d will be large and I and c small. We present a (16,9,6,3,4) dc free block c6de, and a (30,20,10,6,4) dc free block code. Easy encoding and decoding procedures for these c...

متن کامل

Theory and design of m-ary balanced codes which are invariant under symbol permutation

A symbol permutation invariant balanced (SPI-balanced) code over the alphabet Zm = {0, 1, . . . , m − 1} is a block code over Zm such that each alphabet symbol occurs as many times as any other symbol in every codeword. For this reason every permutation among the symbols of the alphabet changes a SPI-balanced code into a SPI-balanced code. This means that SPI-balanced words are “the most balanc...

متن کامل

New multilevel codes over GF(q)

In this paper, we apply set partitioning to multi-dimensional signal spaces over GF(q), particularly GFq-l(q) and GFq(q), and show how to construct both multi-level block codes and multi-level trellis codes over GF(q). We present two classes of multi-level (n, k, d) block codes over GF(q) with block length n, number of information symbols k, and minimum ,1-1 • { d } distance d_n >_ d, where n =...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012